Comparison of Direct and Iterative Sparse Linear Solvers for Power System Applications on Parallel Computing Platforms
نویسندگان
چکیده
This paper presents a performance comparison of sparse linear solvers based on iterative and direct methods for power system applications implemented on parallel computing platform. The iterative sparse linear solver evaluated in this paper is based on the conjugate gradient algorithm with a Jacobi pre-conditioner executed on a general purpose graphic processing unit (GPGPU). The direct solvers are based on the SuiteSparseQR library implementing a QR factorization, and PARDISO, implementing a LU factorization, with both providing parallel implementations through Intel Threading Building Blocks and OpenMP respectively. The type of matrices tested during the evaluation are Jacobian and Gain matrices from state estimation applications, and DC power flow Jacobian matrices from power flow analysis and security constrained optimal power flow applications. The evaluation of the different solvers on each matrices showed that iterative methods are good candidates for power flow analysis application when the DC power flow Jacobian matrices are large and well conditioned. Direct methods based solvers outperform iterative solvers for matrices found in state estimation and security constrained power flow analysis application mainly due to the poor performances of iterative methods on ill-conditioned matrices.
منابع مشابه
PSPIKE: A Parallel Hybrid Sparse Linear System Solver
The availability of large-scale computing platforms comprised of tens of thousands of multicore processors motivates the need for the next generation of highly scalable sparse linear system solvers. These solvers must optimize parallel performance, processor (serial) performance, as well as memory requirements, while being robust across broad classes of applications and systems. In this paper, ...
متن کاملA domain-decomposing parallel sparse linear system solver
The solution of large sparse linear systems is often the most time-consuming part of many science and engineering applications. Computational fluid dynamics, circuit simulation, power network analysis, and material science are just a few examples of the application areas in which large sparse linear systems need to be solved effectively. In this paper we introduce a new parallel hybrid sparse l...
متن کاملA priori power estimation of linear solvers on multi-core processors
High-performance computing (HPC) centres simulate complex scientific models which provide vital understanding of our world. In the recent years, power efficiency has become a critical aspect in the new HPC facilities because of high energy consumption costs. In this work, we present our study on power consumption of linear solvers on modern multi-core CPUs which are widely used in many scientif...
متن کاملParallel Block-Diagonal-Bordered Sparse Linear Solvers for Electrical Power System Applications
Research is ongoing that examines parallel direct block-diagonal-bordered sparse linear solvers for irregular sparse matrix problems derived from electrical power system applications. Parallel block-diagonal-bordered sparse linear solvers exhibit distinct advantages when compared to current general parallel direct sparse matrix solvers. Our research shows that actual power system matrices can b...
متن کاملIterative and Direct Sparse Solvers on Parallel Computers
Solving large sparse systems of linear equations is required for a wide range of numerical applications. This paper addresses the main issues raised during the parallelization of iterative and direct solvers for such systems in distributed memory multiprocessors. If no preconditioning is considered, iterative solvers are simple to parallelize, as the most time-consuming computational structures...
متن کامل